The Inertia of Unicyclic Graphs and Bicyclic Graphs
نویسندگان
چکیده
Let G be a graph with n vertices and ν(G) be the matching number of G. The inertia of a graph G, In(G) = (n+, n−, n0) is an integer triple specifying the numbers of positive, negative and zero eigenvalues of the adjacency matrix A(G), respectively. Let η(G) = n0 denote the nullity of G (the multiplicity of the eigenvalue zero of G). It is well known that if G is a tree, then η(G) = n− 2ν(G). Guo et al. [Ji-Ming Guo, Weigen Yan and Yeong-Nan Yeh. On the nullity and the matching number of unicyclic graphs, Linear Algebra and its Applications, 431 (2009), 1293–1301.] proved if G is a unicyclic graph, then η(G) equals n − 2ν(G) − 1, n − 2ν(G) or n − 2ν(G) + 2. Barrett et al. determined the inertia sets for trees and graphs with cut vertices. In this paper, we give the nullity of bicyclic graphs B n . Furthermore, we determine the inertia set in unicyclic graphs and B n , respectively.
منابع مشابه
The maximal total irregularity of some connected graphs
The total irregularity of a graph G is defined as 〖irr〗_t (G)=1/2 ∑_(u,v∈V(G))▒〖|d_u-d_v |〗, where d_u denotes the degree of a vertex u∈V(G). In this paper by using the Gini index, we obtain the ordering of the total irregularity index for some classes of connected graphs, with the same number of vertices.
متن کاملEla Some Results on the Spectral Radii of Trees, Unicyclic, and Bicyclic Graphs
Let ∆(G), ∆ for short, be the maximum degree of a graph G. In this paper, trees (resp., unicyclic graphs and bicyclic graphs), which attain the first and the second largest spectral radius with respect to the adjacency matrix in the class of trees (resp., unicyclic graphs and bicyclic graphs) with n vertices and the maximum degree ∆, where ∆ ≥ n+1 2 (resp., ∆ ≥ n 2 +1 and ∆ ≥ n+3 2 ) are determ...
متن کاملSome results on the spectral radii of trees, unicyclic and bicyclic graphs
Let ∆(G), ∆ for short, be the maximum degree of a graph G. In this paper, trees (resp., unicyclic graphs and bicyclic graphs), which attain the first and the second largest spectral radius with respect to the adjacency matrix in the class of trees (resp., unicyclic graphs and bicyclic graphs) with n vertices and the maximum degree ∆, where ∆ ≥ n+1 2 (resp., ∆ ≥ n 2 +1 and ∆ ≥ n+3 2 ) are determ...
متن کاملSigned graphs with small positive index of inertia
In this paper, the signed graphs with one positive eigenvalue are characterized, and the signed graphs with pendant vertices having exactly two positive eigenvalues are determined. As a consequence, the signed trees, the signed unicyclic graphs and the signed bicyclic graphs having one or two positive eigenvalues are characterized.
متن کاملGraphs with smallest forgotten index
The forgotten topological index of a molecular graph $G$ is defined as $F(G)=sum_{vin V(G)}d^{3}(v)$, where $d(u)$ denotes the degree of vertex $u$ in $G$. The first through the sixth smallest forgotten indices among all trees, the first through the third smallest forgotten indices among all connected graph with cyclomatic number $gamma=1,2$, the first through<br /...
متن کامل